Robustness of multiparty entanglement

Robustness of entanglement

In the quest of completely describing entanglement in the general case of a finite number of parties sharing a physical system of finite dimensional Hilbert space a new entanglement magnitude is introduced for its pure and mixed states: robustness. It corresponds to the minimal amount of mixing with locally prepared states which washes out all entanglement. It quantifies in a sense the endurenc...

Distributed Compression and Multiparty Squashed Entanglement

We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two senders and arises through the repeated application of the two-sender protocol. We describe bounds on the achievable rate region for the distributed compression...

Multiparty secret sharing of quantum information based on entanglement swapping

A protocol of multiparty secret sharing of quantum information based on entanglement swapping is analyzed. In this protocol, Bell states are needed in order to realize the quantum information secret sharing and it is convenient to realize the quantum secret sharing among the members of any subset of users.  2004 Elsevier B.V. All rights reserved. PACS: 03.67.Dd; 03.65.Ud

Robustness of Entanglement for Bell Decomposable States

We propose a simple geometrical approach for finding the robustness of entanglement for Bell decomposable states of 2 ⊗ 2 quantum systems. It is shown that the robustness of entanglement is equal to the concurrence. We also present an analytical expression for two separable states that wipe out all entanglement of these states. Finally the random robustness of these states is also obtained.

Efficient Generation of Photonic Entanglement and Multiparty Quantum Communication